| 翻訳と辞書 |
zero game
In combinatorial game theory, the zero game is the game where neither player has any legal options. Therefore, under the normal play convention, the first player automatically loses, and it is a second-player win. The zero game has a Sprague–Grundy value of zero. The combinatorial notation of the zero game is: .〔.〕
A zero game should be contrasted with the star game , which is a first-player win since either player must (if first to move in the game) move to a zero game, and therefore win.〔
==Examples==
Simple examples of zero games include Nim with no piles〔, p. 122.〕 or a Hackenbush diagram with nothing drawn on it.〔, p. 87.〕
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「zero game」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|